A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs
نویسندگان
چکیده
منابع مشابه
A Linear Time Algorithm for the Minimum Spanning Tree Problem on a Planar Graph
In this paper, we propose a linear time algorithm for nding a minimum spanning tree on a planar graph.
متن کاملA Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
Given a graph G, a designated vertex r and a natural number k, we wish to find k “independent” spanning trees ofG rooted at r, that is, k spanning trees such that, for any vertex v, the k paths connecting r and v in the k trees are internally disjoint in G. In this paper we give a linear-time algorithm to find k independent spanning trees in a k-connected maximal planar graph rooted at any desi...
متن کاملA Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs
Given a graph G, a designated vertex r and a natural number k, we wish to find k “independent” spanning trees of G rooted at r, that is, k spanning trees such that, for any vertex v, the k paths connecting r and v in the k trees are internally disjoint in G. In this paper we give a linear-time algorithm to find four independent spanning trees in a 4-connected planar graph rooted at any vertex.
متن کاملA Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees
A locally connected spanning tree (LCST) T of a graph G is a spanning tree of G such that for each node its neighborhood in T induces a connected subgraph in G. The problem of determining whether a graph contains an LCST or not has been proved to be NP-complete, even if the graph is planar or chordal. The main result of this paper is a linear time algorithm that, given an SC 3-tree (i.e. a maxi...
متن کاملLocally connected spanning trees on graphs
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v ∈ V (G). The purpose of this paper is to give linear-time algorithms for finding locally connected spanning trees on strongly chordal graphs and proper circular-arc graphs, respectively.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2018.02.025